Space/Time Trade-Offs for Higher Radix Modular Multiplication Using Repeated Addition
نویسنده
چکیده
The value of using a higher radix for modular multiplication in the context of RSA is investigated. The main conclusion is that for algorithms which perform the multiplication via repeated addition, there is, broadly speaking, a direct trade-off between space and time provided by change of radix. Thus chip area utilised is roughly proportional to speed. However, initially as the radix is increased from 2, there is a short-lived increase in speed greater than the extra area used. IEEE Transactions on Computers, vol. 46 no. 2, (Feb 1997), pp. 139-141.
منابع مشابه
High-Radix Montgomery Modular Exponentiation on Reconfigurable Hardware
It is widely recognized that security issues will play a crucial role in the majority of future computer and communication systems. Central tools for achieving system security are cryptographic algorithms. This contribution proposes arithmetic architectures which are optimized for modern field programmable gate arrays (FPGAs). The proposed architectures perform modular exponentiation with very ...
متن کاملA Hardware Organization of High-Radix Modular Multiplication for RSA Cryptosystem
Hardware organized modular multiplication based on division algorithm is one of the effective methods used for RSA encryption/decryption. This paper generalizes the hardware organization of the modular multiplication based on the higher-radix SRT division algorithm, and describes the area/time trade-off of the organization. For the number representation we used the signed-digit number system an...
متن کاملHigh-radix modular multiplication for cryptosystems
Two algorithms for modular multiplication with very large moduli are analyzed, in particular for their applicability when a high radix is used for the multiplier. Both algorithms perform modulo reductions interleaved with the addition of partial products, one algorithm is using the standard residue system, whereas the other utilizes a non-standard system employing reductions modulo a power of t...
متن کاملMontgomery's Multiplication Technique: How to Make It Smaller and Faster
Montgomery’s modular multiplication algorithm has enabled considerable progress to be made in the speeding up of RSA cryptosystems. Perhaps the systolic array implementation stands out most in the history of its success. This article gives a brief history of its implementation in hardware, taking a broad view of the many aspects which need to be considered in chip design. Among these are trade-...
متن کاملRadix-4 and radix-8 booth encoded interleaved modular multipliers over general Fp
This paper presents radix-4 and radix-8 Booth encoded modular multipliers over general Fp based on interleaved multiplication algorithm. An existing bit serial interleaved multiplication algorithm is modified using radix-4, radix-8 and Booth recoding techniques. The modified radix-4 and radix-8 versions of interleaved multiplication result in 50% and 75% reduction in required number of clock cy...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- IEEE Trans. Computers
دوره 46 شماره
صفحات -
تاریخ انتشار 1997